Commitments: binding and being bound
نویسندگان
چکیده
Abstract This paper considers the commitments we make by our linguistic choices, and things are committed to uses of language; it also how these can be avoided.
منابع مشابه
Computationally Binding Quantum Commitments
We present a new definition of computationally binding commitment schemes in the quantum setting, which we call “collapse-binding”. The definition applies to string commitments, composes in parallel, and works well with rewindingbased proofs. We give simple constructions of collapse-binding commitments in the random oracle model, giving evidence that they can be realized from hash functions lik...
متن کاملCollapse-binding commitments in the standard model∗
Introduction. Commitment schemes are one of the most fundamental primitives in cryptography. A commitment scheme is a two-party protocol consisting of two phases, the commit and the open phase. The goal of the commitment is to allow the sender to transmit information related to a message m during the commit phase in such a way that the recipient learns nothing about the message (hiding property...
متن کاملCollapse-Binding Quantum Commitments Without Random Oracles
We construct collapse-binding commitments in the standard model. Collapse-binding commitments were introduced by Unruh (Eurocrypt 2016) to model the computational-binding property of commitments against quantum adversaries, but only constructions in the random oracle model were known. Furthermore, we show that collapse-binding commitments imply selected other security definitions for quantum co...
متن کاملDelaying Variable Binding Commitments in Planning
One of the problems with many partial-order planners is their eager commitment to variable bindings. This is contrary to their control decision in delayedcommitment of operator orderings. In this paper we present an extension to the classical partial-order planners by associating every variable with a finite domain of values. The extended planner applies constraint satisfaction routines to chec...
متن کاملConstant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
When commitment schemes are used in complex environments, e.g., the Internet, the issue of malleability appears, i.e., a concurrent man-in-the-middle adversary might generate commitments to values related to ones committed to by honest players. In the plain model, the current best solution towards resolving this problem in a constant number of rounds is the work of Ostrovsky, Persiano and Visco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Zeitschrift Fur Sprachwissenschaft
سال: 2023
ISSN: ['1613-3706', '0721-9067']
DOI: https://doi.org/10.1515/zfs-2023-2003